|
|
Sequential and Parallel Grammars: Properties and Applications
Klobučníková, Dominika ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
This thesis deals with the topic of sequential and parallel grammars. Both of these groups cover a large number of grammar families, most of which, however, are not widely used because of the difficulties related to their processing. The thesis examines some of these grammar types, such as scattered-context grammars, multigenerative systems, and interactive L-systems, with focus on their normal forms. Subsequently, it introduces a set of algorithms utilising properties of the discussed grammar types as well as their normal forms. These algorithms are based on the Cocke-Younger-Kasami algorithm for context-free grammars, and are capable of parsing any grammar in the corresponding normal form. Finally, a program implementing the proposed algorithms is presented.
|
|
|
Transformation of Grammars into Normal Forms
Klapuchová, Mirka ; Koutný, Jiří (referee) ; Zemek, Petr (advisor)
This thesis deals with issues of normal forms from theory of formal languages. Basic terms from this area are listed here, different types of grammars as well and especially normal forms and algorithms that transfer grammars into normal forms. Description of design and implementation of program which is used to transfer input grammar into entered normal form is included.
|
|
|
Syntactic Analysis Based on Matrix Grammar
Brindza, Dominik ; Horáček, Petr (referee) ; Zámečníková, Eva (advisor)
The subject of this thesis is to develop a method of syntactic analysis based on matrix grammar s. In its theoretical part we provide various analytical aspects for this type of regulated grammar in order to reveal the common background as well as search for similarities with the classical context-free grammars which we will then be able to benefit from in the practical part. Our goal is to extend the well-known predictive method of syntactic analysis to further accept a wider spectrum of formal languages - some of the context-sensitive ones which we are able to generate using our matrix grammars. Besides this main effort we also present some experimental algorithms and suggestions hich could be used in further research of this project.
|
|
|
Sequential and Parallel Grammars: Properties and Applications
Klobučníková, Dominika ; Martiško, Jakub (referee) ; Meduna, Alexandr (advisor)
This thesis deals with the topic of sequential and parallel grammars. Both of these groups cover a large number of grammar families, most of which, however, are not widely used because of the difficulties related to their processing. The thesis examines some of these grammar types, such as scattered-context grammars, multigenerative systems, and interactive L-systems, with focus on their normal forms. Subsequently, it introduces a set of algorithms utilising properties of the discussed grammar types as well as their normal forms. These algorithms are based on the Cocke-Younger-Kasami algorithm for context-free grammars, and are capable of parsing any grammar in the corresponding normal form. Finally, a program implementing the proposed algorithms is presented.
|
|
|
Syntactic Analysis Based on Matrix Grammar
Brindza, Dominik ; Horáček, Petr (referee) ; Zámečníková, Eva (advisor)
The subject of this thesis is to develop a method of syntactic analysis based on matrix grammar s. In its theoretical part we provide various analytical aspects for this type of regulated grammar in order to reveal the common background as well as search for similarities with the classical context-free grammars which we will then be able to benefit from in the practical part. Our goal is to extend the well-known predictive method of syntactic analysis to further accept a wider spectrum of formal languages - some of the context-sensitive ones which we are able to generate using our matrix grammars. Besides this main effort we also present some experimental algorithms and suggestions hich could be used in further research of this project.
|
|
|
Transformation of Grammars into Normal Forms
Klapuchová, Mirka ; Koutný, Jiří (referee) ; Zemek, Petr (advisor)
This thesis deals with issues of normal forms from theory of formal languages. Basic terms from this area are listed here, different types of grammars as well and especially normal forms and algorithms that transfer grammars into normal forms. Description of design and implementation of program which is used to transfer input grammar into entered normal form is included.
|
guest ::
